Filtros : "Engineering Optimization" Limpar

Filtros



Refine with date range


  • Source: Engineering Optimization. Unidades: EESC, IME

    Assunto: ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ABREU, Levi Ribeiro de et al. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, v. 54, n. 9, p. 1563-1582, 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2021.1957101. Acesso em: 30 maio 2024.
    • APA

      Abreu, L. R. de, Araújo, K. A. G., Prata, B. de A., Nagano, M. S., & Moccellin, J. V. (2022). A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, 54( 9), 1563-1582. doi:10.1080/0305215X.2021.1957101
    • NLM

      Abreu LR de, Araújo KAG, Prata B de A, Nagano MS, Moccellin JV. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions [Internet]. Engineering Optimization. 2022 ; 54( 9): 1563-1582.[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2021.1957101
    • Vancouver

      Abreu LR de, Araújo KAG, Prata B de A, Nagano MS, Moccellin JV. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions [Internet]. Engineering Optimization. 2022 ; 54( 9): 1563-1582.[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2021.1957101
  • Source: Engineering Optimization. Unidade: EESC

    Subjects: PROGRAMAÇÃO DA PRODUÇÃO, SCHEDULING, ALGORITMOS DE SCHEDULING, ENGENHARIA DE PRODUÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PRATA, Bruno de Athayde e NAGANO, Marcelo Seido. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, p. [1-15], 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2022.2144274. Acesso em: 30 maio 2024.
    • APA

      Prata, B. de A., & Nagano, M. S. (2022). A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, [1-15]. doi:10.1080/0305215X.2022.2144274
    • NLM

      Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274
    • Vancouver

      Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274
  • Source: Engineering Optimization. Unidade: EESC

    Subjects: ALGORITMOS, PROGRAMAÇÃO DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      NAGANO, Marcelo Seido e ALMEIDA, Fernando Siqueira de e MIYATA, Hugo Hissashi. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, p. [1-20], 2020Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2020.1797000. Acesso em: 30 maio 2024.
    • APA

      Nagano, M. S., Almeida, F. S. de, & Miyata, H. H. (2020). An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, [1-20]. doi:10.1080/0305215X.2020.1797000
    • NLM

      Nagano MS, Almeida FS de, Miyata HH. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Engineering Optimization. 2020 ; [1-20].[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000
    • Vancouver

      Nagano MS, Almeida FS de, Miyata HH. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Engineering Optimization. 2020 ; [1-20].[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000
  • Source: Engineering Optimization. Unidade: EESC

    Subjects: ESTRUTURAS, RISCO, BENCHMARKING, ESTRUTURAS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BECK, André Teófilo e TESSARI, Rodolfo Krul e KROETZ, Henrique Machado. System reliability-based design optimization and risk-based optimization: a benchmark example considering progressive collapse. Engineering Optimization, v. 51, n. 6, p. 1000-1012, 2019Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2018.1502760. Acesso em: 30 maio 2024.
    • APA

      Beck, A. T., Tessari, R. K., & Kroetz, H. M. (2019). System reliability-based design optimization and risk-based optimization: a benchmark example considering progressive collapse. Engineering Optimization, 51( 6), 1000-1012. doi:10.1080/0305215X.2018.1502760
    • NLM

      Beck AT, Tessari RK, Kroetz HM. System reliability-based design optimization and risk-based optimization: a benchmark example considering progressive collapse [Internet]. Engineering Optimization. 2019 ; 51( 6): 1000-1012.[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2018.1502760
    • Vancouver

      Beck AT, Tessari RK, Kroetz HM. System reliability-based design optimization and risk-based optimization: a benchmark example considering progressive collapse [Internet]. Engineering Optimization. 2019 ; 51( 6): 1000-1012.[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2018.1502760
  • Source: Engineering Optimization. Unidade: EESC

    Subjects: MANUTENÇÃO PREVENTIVA, HEURÍSTICA, SCHEDULING

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MIYATA, Hugo Hissashi e NAGANO, Marcelo Seido e GUPTAB, Jatinder N. D. Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study. Engineering Optimization, v. 51, n. 4, 2018Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2018.1485903. Acesso em: 30 maio 2024.
    • APA

      Miyata, H. H., Nagano, M. S., & Guptab, J. N. D. (2018). Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study. Engineering Optimization, 51( 4). doi:10.1080/0305215X.2018.1485903
    • NLM

      Miyata HH, Nagano MS, Guptab JND. Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study [Internet]. Engineering Optimization. 2018 ; 51( 4):[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2018.1485903
    • Vancouver

      Miyata HH, Nagano MS, Guptab JND. Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study [Internet]. Engineering Optimization. 2018 ; 51( 4):[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2018.1485903
  • Source: Engineering Optimization. Unidade: EESC

    Subjects: HEURÍSTICA, SCHEDULING

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      NAGANO, Marcelo Seido e ROSSI, Fernando Luis e MARTARELLI, Nádia Junqueira. High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Engineering Optimization, v. 51, n. 2, 2018Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2018.1444163. Acesso em: 30 maio 2024.
    • APA

      Nagano, M. S., Rossi, F. L., & Martarelli, N. J. (2018). High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Engineering Optimization, 51( 2). doi:10.1080/0305215X.2018.1444163
    • NLM

      Nagano MS, Rossi FL, Martarelli NJ. High-performing heuristics to minimize flowtime in no-idle permutation flowshop [Internet]. Engineering Optimization. 2018 ; 51( 2):[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2018.1444163
    • Vancouver

      Nagano MS, Rossi FL, Martarelli NJ. High-performing heuristics to minimize flowtime in no-idle permutation flowshop [Internet]. Engineering Optimization. 2018 ; 51( 2):[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2018.1444163
  • Source: Engineering Optimization. Unidades: IME, EP

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, SCHEDULING

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg e RONCONI, Débora Pretti. Heuristic methods for the single machine scheduling problem with different ready times and a common due date. Engineering Optimization, v. 44, n. 10, p. 1197-1208, 2012Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2011.634409. Acesso em: 30 maio 2024.
    • APA

      Birgin, E. J. G., & Ronconi, D. P. (2012). Heuristic methods for the single machine scheduling problem with different ready times and a common due date. Engineering Optimization, 44( 10), 1197-1208. doi:10.1080/0305215X.2011.634409
    • NLM

      Birgin EJG, Ronconi DP. Heuristic methods for the single machine scheduling problem with different ready times and a common due date [Internet]. Engineering Optimization. 2012 ; 44( 10): 1197-1208.[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2011.634409
    • Vancouver

      Birgin EJG, Ronconi DP. Heuristic methods for the single machine scheduling problem with different ready times and a common due date [Internet]. Engineering Optimization. 2012 ; 44( 10): 1197-1208.[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/0305215X.2011.634409
  • Source: Engineering Optimization. Unidade: EP

    Subjects: CONTROLE DE PROCESSOS (ON-LINE), CADEIAS DE MARKOV

    PrivadoAcesso à fonteAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      QUININO, Roberto da Costa e HO, Linda Lee. Effects of the preventive and corrective adjustments in economical designs for online process control for attributes with misclassification errors. Engineering Optimization, v. 42, n. Ja 2010, p. 17\201331, 2010Tradução . . Disponível em: https://doi.org/10.1080/03052150902971674. Acesso em: 30 maio 2024.
    • APA

      Quinino, R. da C., & Ho, L. L. (2010). Effects of the preventive and corrective adjustments in economical designs for online process control for attributes with misclassification errors. Engineering Optimization, 42( Ja 2010), 17\201331. doi:10.1080/03052150902971674
    • NLM

      Quinino R da C, Ho LL. Effects of the preventive and corrective adjustments in economical designs for online process control for attributes with misclassification errors [Internet]. Engineering Optimization. 2010 ; 42( Ja 2010): 17\201331.[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/03052150902971674
    • Vancouver

      Quinino R da C, Ho LL. Effects of the preventive and corrective adjustments in economical designs for online process control for attributes with misclassification errors [Internet]. Engineering Optimization. 2010 ; 42( Ja 2010): 17\201331.[citado 2024 maio 30 ] Available from: https://doi.org/10.1080/03052150902971674

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024